Fast computation of abelian runs
نویسندگان
چکیده
منابع مشابه
Fast computation of abelian runs
Given a word w and a Parikh vector P , an abelian run of period P in w is a maximal occurrence of a substring of w having abelian period P . Our main result is an online algorithm that, given a word w of length n over an alphabet of cardinality σ and a Parikh vector P , returns all the abelian runs of period P in w in time O(n) and space O(σ + p), where p is the norm of P , i.e., the sum of its...
متن کاملOnline Computation of Abelian Runs
Given a word w and a Parikh vector P, an abelian run of period P in w is a maximal occurrence of a substring of w having abelian period P. We give an algorithm that finds all the abelian runs of period P in a word of length n in time O(n× |P|) and space O(σ + |P|).
متن کاملComputing Abelian Covers and Abelian Runs
Two strings u and v are said to be Abelian equivalent if u is a permutation of the characters of v. We introduce two new regularities on strings w.r.t. Abelian equivalence, called Abelian covers and Abelian runs, which are generalizations of covers and runs of strings, respectively. We show how to determine in O(n) time whether or not a given string w of length n has an Abelian cover. Also, we ...
متن کاملQuantum Computation with Abelian Anyons
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topolog-ical effects. Single-anyon operations such as hopping from site to site on a lattice suffice to perform all quantum logic operations. Quantum computation using abelian anyons shares some but not all of the robustness of quantum computa...
متن کاملAbelian Hypergroups and Quantum Computation
Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using abelian hypergroups and an associated classical simulation theorem (a la Gottesman-Knill). Using these tools, we develop the first provably efficient quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.12.010